Introduction

This series began with an introductory DSA course that taught the common data structures used, graph algorithms, greedy algorithms, divide-and-conquer algorithms, etc.

Next was the AI: Search Methods for Problem Solving course that expanded on the basics including Search Space algorithms, Solution Space algorithms and Planning Space algorithms.

It was concluded with the Advanced Algorithms course that discussed Dynamic Programming and other advanced algorithms to tackle NP-hard problems like Travelling Salesman Problem and SAT problem.

Associated Projects:

• Travelling Salesman Problem

• Connect 4